<HTML><HEAD><TITLE>Comparing and Sorting</TITLE></HEAD><BODY>
[ <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]<H1>Comparing and Sorting</H1>
Built-ins for symbolic term comparison and sorting
<H2>Predicates</H2>
<BLOCKQUOTE>
<DL>
<DT><A HREF="E-2.html"><STRONG>?Term1 = ?Term2</STRONG></A></DT>
<DD>Succeeds if Term1 and Term2 unify.

</DD>
<DT><A HREF="EE-2.html"><STRONG>?Term1 == ?Term2</STRONG></A></DT>
<DD>Succeeds if Term1 and Term2 are identical terms.

</DD>
<DT><A HREF="AL-2.html"><STRONG>?Term1 @< ?Term2</STRONG></A></DT>
<DD>Succeeds if term Term1 is before term Term2 in the standard ordering.

</DD>
<DT><A HREF="AEL-2.html"><STRONG>?Term1 @=< ?Term2</STRONG></A></DT>
<DD>Succeeds if term Term1 is before or equal to Term2 in the standard
ordering.

</DD>
<DT><A HREF="AG-2.html"><STRONG>?Term1 @> ?Term2</STRONG></A></DT>
<DD>Succeeds if term Term1 is after term Term2 in the standard ordering.

</DD>
<DT><A HREF="AGE-2.html"><STRONG>?Term1 @>= ?Term2</STRONG></A></DT>
<DD>Succeeds if term Term1 is after or equal to Term2 in the standard ordering.

</DD>
<DT><A HREF="RE-2.html"><STRONG>?Term1 \= ?Term2</STRONG></A></DT>
<DD>Succeeds if Term1 and Term2 are not unifiable.

</DD>
<DT><A HREF="REE-2.html"><STRONG>?Term1 \== ?Term2</STRONG></A></DT>
<DD>Succeeds if Term1 and Term2 are not identical terms.

</DD>
<DT><A HREF="compare-3.html"><STRONG>compare(-Ordering, ?Term1, ?Term2)</STRONG></A></DT>
<DD>Succeeds if Ordering is a special atom which describes the ordering between
Term1 and Term2.

</DD>
<DT><A HREF="compare_instances-3.html"><STRONG>compare_instances(-Relationship, ?Term1, ?Term2)</STRONG></A></DT>
<DD>Succeeds if Relationship is an atom describing the instance relationship
between Term1 and Term2.

</DD>
<DT><A HREF="current_domain-3.html"><STRONG>current_domain(?Name, -DefModule, -DomainDef)</STRONG></A></DT>
<DD>Name is the name of a visible domain, defined by DomainDef in DefModule</DD>
<DT><A HREF="domain-1.html"><STRONG>local domain(++Def), export domain(++Def)</STRONG></A></DT>
<DD>Define a domain (a set of symbols mapped to natural numbers)</DD>
<DT><A HREF="domain_index-3.html"><STRONG>domain_index(+Value, -Domain, -Index)</STRONG></A></DT>
<DD>Value is defined in Domain with positional number Index</DD>
<DT><A HREF="instance-2.html"><STRONG>instance(?Instance, ?Term)</STRONG></A></DT>
<DD>Succeeds if Instance is an instance of Term.

</DD>
<DT><A HREF="keysort-2.html"><STRONG>keysort(+List1, -List2)</STRONG></A></DT>
<DD>Succeeds if List2 is a sorted list version of List1, whose elements are of
the form Key-Value.  The sort is done according to the value of the key
Key.

</DD>
<DT><A HREF="merge-3.html"><STRONG>merge(+List1, +List2, -List3)</STRONG></A></DT>
<DD>Succeeds if List3 is a merged list of List1 and List2.  If both lists are
sorted, List3 will be sorted.

</DD>
<DT><A HREF="merge-5.html"><STRONG>merge(+Key, +Order, +List1, +List2, -List3)</STRONG></A></DT>
<DD>Succeeds if List3 is a merged list of List1 and List2.  If both lists are
sorted, List3 will be sorted.  The sort is done according to the Key and
Order specifications.

</DD>
<DT><A HREF="msort-2.html"><STRONG>msort(+List1, -List2)</STRONG></A></DT>
<DD>Succeeds if List2 has the same elements as List1 and is sorted.

</DD>
<DT><A HREF="not_unify-2.html"><STRONG>not_unify(?Term1, ?Term2)</STRONG></A></DT>
<DD>Succeeds if Term1 and Term2 are not unifiable.

</DD>
<DT><A HREF="number_merge-3.html"><STRONG>number_merge(+List1, +List2, -List3)</STRONG></A></DT>
<DD>Succeeds if List3 is a merged list of List1 and List2.  If both lists are
sorted, List3 will be sorted.

</DD>
<DT><A HREF="number_merge-5.html"><STRONG>number_merge(+Key, +Order, +List1, +List2, -List3)</STRONG></A></DT>
<DD>Succeeds if List3 is a merged list of List1 and List2.  If both lists are
sorted, List3 will be sorted.  The sort is done according to the Key and
Order specifications.

</DD>
<DT><A HREF="number_sort-2.html"><STRONG>number_sort(+List1, -List2)</STRONG></A></DT>
<DD>Succeeds if List2 is the numerically ordered version of List1.

</DD>
<DT><A HREF="number_sort-4.html"><STRONG>number_sort(+Key, +Order, +Random, -Sorted)</STRONG></A></DT>
<DD>Succeeds if Sorted is the numerically sorted list
	version of Random.  The sort is done according to the Key and
	Order specifications.

</DD>
<DT><A HREF="occurs-2.html"><STRONG>occurs(?Simple, ?Term)</STRONG></A></DT>
<DD>Succeeds if Simple is a variable or an atomic type that occurs in the term
Term.

</DD>
<DT><A HREF="prune_instances-2.html"><STRONG>prune_instances(+List, -PrunedList)</STRONG></A></DT>
<DD>Succeeds if PrunedList is the smallest list that subsumes the list List.

</DD>
<DT><A HREF="sort-2.html"><STRONG>sort(+List1, -List2)</STRONG></A></DT>
<DD>Succeeds if List2 is the strictly ordered, no duplicates version of List1.

</DD>
<DT><A HREF="sort-4.html"><STRONG>sort(+Key, +Order, +Random, -Sorted)</STRONG></A></DT>
<DD>Succeeds if Sorted is the sorted list version of Random.  The sort is done
according to the Key and Order specifications.

</DD>
<DT><A HREF="term_hash-4.html"><STRONG>term_hash(?Term, +Depth, +Range, -Hash)</STRONG></A></DT>
<DD>Computes a hash value for an arbitrary term</DD>
<DT><A HREF="variant-2.html"><STRONG>variant(?Term1, ?Term2)</STRONG></A></DT>
<DD>Succeeds if Term1 is a variant of Term2.

</DD>
<DT><A HREF="TE-2.html"><STRONG>?Term1 ~= ?Term2</STRONG></A></DT>
<DD>The sound difference operator.  Succeeds if the two terms cannot be
unified, fails if they are identical, otherwise it delays.

</DD>
</DL>
</BLOCKQUOTE>
<HR>Generated from termcomp.eci on 2009-05-27 01:25
</BODY></HTML>
